Extremal norms of graphs and matrices

نویسنده

  • Vladimir Nikiforov
چکیده

In the recent years, the trace norm of graphs has been extensively studied under the name of graph energy. In this paper some of this research is extended to more general matrix norms, like the Schatten p-norms and the Ky Fan k-norms. Whenever possible the results are given both for graphs and general matrices. In various contexts a puzzling fact was observed: the Schatten p-norms are widely di¤erent for 1 p < 2 and for p 2:

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Beyond graph energy: norms of graphs and matrices

In 1978 Gutman introduced the energy of a graph as the sum of the absolute values of graph eigenvalues, and ever since then graph energy has been intensively studied. Since graph energy is the trace norm of the adjacency matrix, matrix norms provide a natural background for its study. Thus, this paper surveys research on matrix norms that aims to expand and advance the study of graph energy. Th...

متن کامل

Eccentric Connectivity Index: Extremal Graphs and Values

Eccentric connectivity index has been found to have a low degeneracy and hence a significant potential of predicting biological activity of certain classes of chemical compounds. We present here explicit formulas for eccentric connectivity index of various families of graphs. We also show that the eccentric connectivity index grows at most polynomially with the number of vertices and determine ...

متن کامل

The Extremal Graphs for (Sum-) Balaban Index of Spiro and Polyphenyl Hexagonal Chains

As highly discriminant distance-based topological indices, the Balaban index and the sum-Balaban index of a graph $G$ are defined as $J(G)=frac{m}{mu+1}sumlimits_{uvin E} frac{1}{sqrt{D_{G}(u)D_{G}(v)}}$ and $SJ(G)=frac{m}{mu+1}sumlimits_{uvin E} frac{1}{sqrt{D_{G}(u)+D_{G}(v)}}$, respectively, where $D_{G}(u)=sumlimits_{vin V}d(u,v)$ is the distance sum of vertex $u$ in $G$, $m$ is the n...

متن کامل

The Signless Laplacian Estrada Index of Unicyclic Graphs

‎For a simple graph $G$‎, ‎the signless Laplacian Estrada index is defined as $SLEE(G)=sum^{n}_{i=1}e^{q^{}_i}$‎, ‎where $q^{}_1‎, ‎q^{}_2‎, ‎dots‎, ‎q^{}_n$ are the eigenvalues of the signless Laplacian matrix of $G$‎. ‎In this paper‎, ‎we first characterize the unicyclic graphs with the first two largest and smallest $SLEE$'s and then determine the unique unicyclic graph with maximum $SLEE$ a...

متن کامل

The generalized spectral radius and extremal norms

The generalized spectral radius, also known under the name of joint spectral radius, or (after taking logarithms) maximal Lyapunov exponent of a discrete inclusion is examined. We present a new proof for a result of Barabanov, which states that for irreducible sets of matrices an extremal norm always exists. This approach lends itself easily to the analysis of further properties of the generali...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010